Implementing an abstraction framework for soft constraints
Identifieur interne :
000171 ( PascalFrancis/Corpus );
précédent :
000170;
suivant :
000172
Implementing an abstraction framework for soft constraints
Auteurs : Alberto Delgado ;
Jorge Andres Perez ;
Camilo RuedaSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2005.
RBID : Pascal:05-0409212
Descripteurs français
English descriptors
Abstract
Soft constraints are flexible schemes for modeling a wide spectrum of problems. A model based on a hierarchy of abstractions of soft constraint problems has been proposed before. We describe an efficient implementation of this scheme aimed at solving real life problems. Our system is integrated into the Mozart language in such a way that user control of the abstraction mechanism is straightforward.We explain how we adapted the theoretical results for our purposes and describe the experiences in this adaptation. We give comparative analysis of our system with respect to an implementation using soft constraints without the abstraction mechanism. Our tests show good performance results for over-constrained problems in real settings.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 3607 |
|---|
| A08 | 01 | 1 | ENG | @1 Implementing an abstraction framework for soft constraints |
|---|
| A09 | 01 | 1 | ENG | @1 SARA 2005 : abstraction, reformulation and approximation : Airth Castle, 26-29 July 2005 |
|---|
| A11 | 01 | 1 | | @1 DELGADO (Alberto) |
|---|
| A11 | 02 | 1 | | @1 PEREZ (Jorge Andres) |
|---|
| A11 | 03 | 1 | | @1 RUEDA (Camilo) |
|---|
| A12 | 01 | 1 | | @1 ZUCKER (Jean-Daniel) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 SAITTA (Lorenza) @9 ed. |
|---|
| A14 | 01 | | | @1 Pontificia Universidad Javeriana @2 Cali @3 COL @Z 1 aut. @Z 2 aut. @Z 3 aut. |
|---|
| A20 | | | | @1 60-75 |
|---|
| A21 | | | | @1 2005 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-27872-9 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000124490140050 |
|---|
| A44 | | | | @0 0000 @1 © 2005 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 16 ref. |
|---|
| A47 | 01 | 1 | | @0 05-0409212 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 Soft constraints are flexible schemes for modeling a wide spectrum of problems. A model based on a hierarchy of abstractions of soft constraint problems has been proposed before. We describe an efficient implementation of this scheme aimed at solving real life problems. Our system is integrated into the Mozart language in such a way that user control of the abstraction mechanism is straightforward.We explain how we adapted the theoretical results for our purposes and describe the experiences in this adaptation. We give comparative analysis of our system with respect to an implementation using soft constraints without the abstraction mechanism. Our tests show good performance results for over-constrained problems in real settings. |
|---|
| C02 | 01 | X | | @0 001D02A05 |
|---|
| C03 | 01 | X | FRE | @0 Abstraction @5 18 |
|---|
| C03 | 01 | X | ENG | @0 Abstraction @5 18 |
|---|
| C03 | 01 | X | SPA | @0 Abstracción @5 18 |
|---|
| C03 | 02 | X | FRE | @0 Satisfaction contrainte @5 23 |
|---|
| C03 | 02 | X | ENG | @0 Constraint satisfaction @5 23 |
|---|
| C03 | 02 | X | SPA | @0 Satisfaccion restricción @5 23 |
|---|
| C03 | 03 | X | FRE | @0 Modélisation @5 24 |
|---|
| C03 | 03 | X | ENG | @0 Modeling @5 24 |
|---|
| C03 | 03 | X | SPA | @0 Modelización @5 24 |
|---|
| C03 | 04 | X | FRE | @0 Résolution problème @5 25 |
|---|
| C03 | 04 | X | ENG | @0 Problem solving @5 25 |
|---|
| C03 | 04 | X | SPA | @0 Resolución problema @5 25 |
|---|
| C03 | 05 | X | FRE | @0 Contrainte souple @4 CD @5 96 |
|---|
| C03 | 05 | X | ENG | @0 Soft constraint @4 CD @5 96 |
|---|
| C03 | 05 | X | SPA | @0 Constreñimiento flexible @4 CD @5 96 |
|---|
| N21 | | | | @1 283 |
|---|
| N44 | 01 | | | @1 OTO |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Abstraction, reformulation and approximation. International symposium @2 6 @3 Airth Castle GBR @4 2005-07-26 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 05-0409212 INIST |
|---|
| ET : | Implementing an abstraction framework for soft constraints |
|---|
| AU : | DELGADO (Alberto); PEREZ (Jorge Andres); RUEDA (Camilo); ZUCKER (Jean-Daniel); SAITTA (Lorenza) |
|---|
| AF : | Pontificia Universidad Javeriana/Cali/Colombie (1 aut., 2 aut., 3 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2005; Vol. 3607; Pp. 60-75; Bibl. 16 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | Soft constraints are flexible schemes for modeling a wide spectrum of problems. A model based on a hierarchy of abstractions of soft constraint problems has been proposed before. We describe an efficient implementation of this scheme aimed at solving real life problems. Our system is integrated into the Mozart language in such a way that user control of the abstraction mechanism is straightforward.We explain how we adapted the theoretical results for our purposes and describe the experiences in this adaptation. We give comparative analysis of our system with respect to an implementation using soft constraints without the abstraction mechanism. Our tests show good performance results for over-constrained problems in real settings. |
|---|
| CC : | 001D02A05 |
|---|
| FD : | Abstraction; Satisfaction contrainte; Modélisation; Résolution problème; Contrainte souple |
|---|
| ED : | Abstraction; Constraint satisfaction; Modeling; Problem solving; Soft constraint |
|---|
| SD : | Abstracción; Satisfaccion restricción; Modelización; Resolución problema; Constreñimiento flexible |
|---|
| LO : | INIST-16343.354000124490140050 |
|---|
| ID : | 05-0409212 |
|---|
Links to Exploration step
Pascal:05-0409212
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Implementing an abstraction framework for soft constraints</title>
<author><name sortKey="Delgado, Alberto" sort="Delgado, Alberto" uniqKey="Delgado A" first="Alberto" last="Delgado">Alberto Delgado</name>
<affiliation><inist:fA14 i1="01"><s1>Pontificia Universidad Javeriana</s1>
<s2>Cali</s2>
<s3>COL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Perez, Jorge Andres" sort="Perez, Jorge Andres" uniqKey="Perez J" first="Jorge Andres" last="Perez">Jorge Andres Perez</name>
<affiliation><inist:fA14 i1="01"><s1>Pontificia Universidad Javeriana</s1>
<s2>Cali</s2>
<s3>COL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Rueda, Camilo" sort="Rueda, Camilo" uniqKey="Rueda C" first="Camilo" last="Rueda">Camilo Rueda</name>
<affiliation><inist:fA14 i1="01"><s1>Pontificia Universidad Javeriana</s1>
<s2>Cali</s2>
<s3>COL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">05-0409212</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 05-0409212 INIST</idno>
<idno type="RBID">Pascal:05-0409212</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000171</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Implementing an abstraction framework for soft constraints</title>
<author><name sortKey="Delgado, Alberto" sort="Delgado, Alberto" uniqKey="Delgado A" first="Alberto" last="Delgado">Alberto Delgado</name>
<affiliation><inist:fA14 i1="01"><s1>Pontificia Universidad Javeriana</s1>
<s2>Cali</s2>
<s3>COL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Perez, Jorge Andres" sort="Perez, Jorge Andres" uniqKey="Perez J" first="Jorge Andres" last="Perez">Jorge Andres Perez</name>
<affiliation><inist:fA14 i1="01"><s1>Pontificia Universidad Javeriana</s1>
<s2>Cali</s2>
<s3>COL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Rueda, Camilo" sort="Rueda, Camilo" uniqKey="Rueda C" first="Camilo" last="Rueda">Camilo Rueda</name>
<affiliation><inist:fA14 i1="01"><s1>Pontificia Universidad Javeriana</s1>
<s2>Cali</s2>
<s3>COL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2005">2005</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Abstraction</term>
<term>Constraint satisfaction</term>
<term>Modeling</term>
<term>Problem solving</term>
<term>Soft constraint</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Abstraction</term>
<term>Satisfaction contrainte</term>
<term>Modélisation</term>
<term>Résolution problème</term>
<term>Contrainte souple</term>
</keywords><front><div type="abstract" xml:lang="en">Soft constraints are flexible schemes for modeling a wide spectrum of problems. A model based on a hierarchy of abstractions of soft constraint problems has been proposed before. We describe an efficient implementation of this scheme aimed at solving real life problems. Our system is integrated into the Mozart language in such a way that user control of the abstraction mechanism is straightforward.We explain how we adapted the theoretical results for our purposes and describe the experiences in this adaptation. We give comparative analysis of our system with respect to an implementation using soft constraints without the abstraction mechanism. Our tests show good performance results for over-constrained problems in real settings.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>3607</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Implementing an abstraction framework for soft constraints</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>SARA 2005 : abstraction, reformulation and approximation : Airth Castle, 26-29 July 2005</s1>
</fA09><fA11 i1="01" i2="1"><s1>DELGADO (Alberto)</s1>
</fA11><fA11 i1="02" i2="1"><s1>PEREZ (Jorge Andres)</s1>
</fA11><fA11 i1="03" i2="1"><s1>RUEDA (Camilo)</s1>
</fA11><fA12 i1="01" i2="1"><s1>ZUCKER (Jean-Daniel)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>SAITTA (Lorenza)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>Pontificia Universidad Javeriana</s1>
<s2>Cali</s2>
<s3>COL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14><fA20><s1>60-75</s1>
</fA20><fA21><s1>2005</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-27872-9</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000124490140050</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2005 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>16 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>05-0409212</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>Soft constraints are flexible schemes for modeling a wide spectrum of problems. A model based on a hierarchy of abstractions of soft constraint problems has been proposed before. We describe an efficient implementation of this scheme aimed at solving real life problems. Our system is integrated into the Mozart language in such a way that user control of the abstraction mechanism is straightforward.We explain how we adapted the theoretical results for our purposes and describe the experiences in this adaptation. We give comparative analysis of our system with respect to an implementation using soft constraints without the abstraction mechanism. Our tests show good performance results for over-constrained problems in real settings.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Abstraction</s0>
<s5>18</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Abstraction</s0>
<s5>18</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Abstracción</s0>
<s5>18</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Satisfaction contrainte</s0>
<s5>23</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Constraint satisfaction</s0>
<s5>23</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Satisfaccion restricción</s0>
<s5>23</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Modélisation</s0>
<s5>24</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Modeling</s0>
<s5>24</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Modelización</s0>
<s5>24</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Résolution problème</s0>
<s5>25</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Problem solving</s0>
<s5>25</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Resolución problema</s0>
<s5>25</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Contrainte souple</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Soft constraint</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Constreñimiento flexible</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fN21><s1>283</s1>
</fN21><fN44 i1="01"><s1>OTO</s1>
</fN44><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>Abstraction, reformulation and approximation. International symposium</s1>
<s2>6</s2>
<s3>Airth Castle GBR</s3>
<s4>2005-07-26</s4>
</fA30><server><NO>PASCAL 05-0409212 INIST</NO>
<ET>Implementing an abstraction framework for soft constraints</ET>
<AU>DELGADO (Alberto); PEREZ (Jorge Andres); RUEDA (Camilo); ZUCKER (Jean-Daniel); SAITTA (Lorenza)</AU>
<AF>Pontificia Universidad Javeriana/Cali/Colombie (1 aut., 2 aut., 3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2005; Vol. 3607; Pp. 60-75; Bibl. 16 ref.</SO>
<LA>Anglais</LA>
<EA>Soft constraints are flexible schemes for modeling a wide spectrum of problems. A model based on a hierarchy of abstractions of soft constraint problems has been proposed before. We describe an efficient implementation of this scheme aimed at solving real life problems. Our system is integrated into the Mozart language in such a way that user control of the abstraction mechanism is straightforward.We explain how we adapted the theoretical results for our purposes and describe the experiences in this adaptation. We give comparative analysis of our system with respect to an implementation using soft constraints without the abstraction mechanism. Our tests show good performance results for over-constrained problems in real settings.</EA>
<CC>001D02A05</CC>
<FD>Abstraction; Satisfaction contrainte; Modélisation; Résolution problème; Contrainte souple</FD>
<ED>Abstraction; Constraint satisfaction; Modeling; Problem solving; Soft constraint</ED>
<SD>Abstracción; Satisfaccion restricción; Modelización; Resolución problema; Constreñimiento flexible</SD>
<LO>INIST-16343.354000124490140050</LO>
<ID>05-0409212</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000171 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000171 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:05-0409212
|texte= Implementing an abstraction framework for soft constraints
}}
| This area was generated with Dilib version V0.6.20.
Data generation: Sun Apr 10 15:06:14 2016. Site generation: Tue Feb 7 15:40:35 2023 |  |
